Branch and Bound Algorithms for Highly Constrained Integer Programs
نویسندگان
چکیده
In this paper we describe a new branch and bound algorithm for solving 0-1 integer linear programs (ILP). The algorithm is specifically targeted at ILP instances that are highly constrained, i.e. instances for which the constraints are hard to satisfy. Our approach is based on recent algorithms for solving instances of Propositional Satisfiability (SAT) which are also highly constrained. In particular we illustrate how the branch and bound algorithm for solving ILPs can be improved with search pruning techniques commonly used in SAT algorithms. The usefulness of the proposed branch and bound algorithm is illustrated on a practical application for which instances are in general highly constrained. Branch and Bound Algorithms for Highly Constrained Integer Programs 1
منابع مشابه
Scenario grouping and decomposition algorithms for chance-constrained programs
A lower bound for a finite-scenario chance-constrained problem is given by the quantile value corresponding to the sorted optimal objective values of scenario subproblems. This quantile bound can be improved by grouping subsets of scenarios at the expense of larger subproblems. The quality of the bound depends on how the scenarios are grouped. We formulate a mixed-integer bilevel program that o...
متن کاملAn Algorithm Based on Theory of Constraints and Branch and Bound for Solving Integrated Product-Mix-Outsourcing Problem
One of the most important decision making problems in many production systems is identification and determination of products and their quantities according to available resources. This problem is called product-mix. However, in the real-world situations, for existing constrained resources, many companies try to provide some products from external resources to achieve more profits. In this pape...
متن کاملSatisfiability-Based Algorithms for 0-1 Integer Programming
In this paper we describe two Propositional Satisfiability-based algorithms for solving 0-1 integer linear programs (ILP). The algorithms are specifically targeted at ILP instances that are highly constrained, i.e. instances for which the constraints are hard to satisfy. The two algorithms are based on recent algorithms for solving instances of Propositional Satisfiability (SAT) which are also ...
متن کاملReformulation and Decomposition of Integer Programs
We examine ways to reformulate integer and mixed integer programs. Typically, but not exclusively, one reformulates so as to obtain stronger linear programming relaxations, and hence better bounds for use in a branch-and-bound based algorithm. First we cover reformulations based on decomposition, such as Lagrangean relaxation, the Dantzig-Wolfe reformulation and the resulting column generation ...
متن کاملAn Augment-and-Branch-and-Cut Framework for Mixed 0-1 Programming
In recent years the branch-and-cut method, a synthesis of the classical branch-and-bound and cutting plane methods, has proven to be a highly successful approach to solving large-scale integer programs to optimality. This is especially true for mixed 0-1 and pure 0-1 problems. However, other approaches to integer programming are possible. One alternative is provided by so-called augmentation al...
متن کامل